VISIBILITY ANALYSIS OF DISTANCE VIEW IN EDO CITY : VISIBILITY MAP PRODUCTION USING GIS
نویسندگان
چکیده
منابع مشابه
The spherical visibility map
We introduce a novel representation for visibility in three dimensions and describe an efficient algorithm to construct it. The data structure is a spherical map that consists of a doubly–connected edge list embedded on the surface of a sphere. Each face of the spherical map is labeled with the polygon visible in the corresponding cone. We demonstrate that the algorithm is efficient and robust ...
متن کاملVisibility Map determination using Angle preprocessing
Visibility determination becomes especially significant in Computer Graphics for walkthrough applications. The aim is to determine those visible objects of the scene from the viewer position. Even when this problem is nowadays efficiently solved by the graphics hardware, when a real-time response is required, some additional CPU processing in the scene geometry may be necessary to deal with lar...
متن کاملApproximate multi-visibility map computation
A multi-visibility map is the subdivision of the domain of a terrain into different regions that, according to different criteria, encode the visibility with respect to a set of view elements. We present an algorithm for computing approximate multi-visibility maps for a terrain, modeled as a TIN, with respect to a set of view segments. Our approach is based on an algorithm that reconstructs an ...
متن کاملDistance Visibility Algorithm (DiVA) Transition
There are three major objectives of this DiVA transition effort: 1) Conduct diver visibility experiments in a range of optical water types to obtain a database for testing and refining the DiVA model; 2) Develop a Monte Carlo model that will be used to perform computer experiments of the DiVA for any combination of water optical properties, environmental conditions, and various types of underwa...
متن کاملComputing the Visibility Map of Fat Objects
We give an output-sensitive algorithm for computing the visibility map of a set of n constant-complexity convex fat polyhedra or curved objects in 3-space. Our algorithm runs in O((n + k) polylog n) time, where k is the combinatorial complexity of the visibility map. This is the first algorithm for computing the visibility map of fat objects that does not require a depth order on the objects an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Doboku Gakkai Ronbunshuu D
سال: 2006
ISSN: 1880-6058
DOI: 10.2208/jscejd.62.496